Pii: S0166-445x(02)00012-7

نویسنده

  • H. M. Levesque
چکیده

The effects of heavy metals on growth, intermediary metabolism and enzyme activities were investigated in yellow perch (Perca fla escens), sampled in summer and fall from lakes situated along a contamination gradient of Cd, Zn and Cu in the mining region of Rouyn–Noranda, Québec. An exposure-dependent decrease in condition factor was observed in both seasons. Liver glycogen and triglyceride reserves were higher in summer than in fall in fish from the reference lake, while the seasonal pattern was different in fish from the contaminated lakes. Plasma free fatty acids (FFA) levels were also influenced by season and contamination. Activities of malic enzyme (ME) and glucose 6-phosphate dehydrogenase (G6PDH) in the liver were higher in the summer than in the fall in reference lakes whereas no seasonal variations were detected in fish from contaminated lakes. Activities of pyruvate kinase (PyK), aspartate transaminase (AST), phosphoenolpyruvate carboxykinase (PEPCK) and malate dehydrogenase (MDH), were higher in fish from contaminated lakes in fall but not in summer. Chronic exposure of yellow perch to sublethal levels of heavy metals impairs growth and alters the seasonal cycling of liver glycogen and triglycerides as well as the activities of metabolic enzymes. © 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cognitive factors in distributed design

Engineering design is being carried out by distributed design teams in an effort to use expert human resources more efficiently. The support needs of distributed design are reviewed from a cognitive viewpoint using five broad categories: design methodology, collaboration, teamwork, knowledge management and design representation. Web-based implementation of iterative, structured design methodolo...

متن کامل

k-Path Partitions in Trees

For a fixed positive integer k, the k-path partition problem is to partition the vertex set of a graph into the smallest number of paths such that each path has at most k vertices. The 2path partition problem is equivalent to the edge-cover problem. This paper presents a linear-time algorithm for the k-path partition problem in trees. The algorithm is applicable to the problem of finding the mi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002